Extended Validity and Consistency in Byzantine Agreement

نویسندگان

  • Matthias Fitzi
  • Martin Hirt
  • Thomas Holenstein
  • Jürg Wullschleger
چکیده

A broadcast protocol allows a sender to distribute a value among a set of players such that it is guaranteed that all players receive the same value (consistency), and if the sender is honest, then all players receive the sender’s value (validity). Classical broadcast protocols for n players provide security with respect to a fixed threshold t < n/3, where both consistency and validity are guaranteed as long as at most t players are corrupted, and no security at all is guaranteed as soon as t + 1 players are corrupted. Depending on the environment, validity or consistency may be the more important property. We generalize the notion of broadcast by introducing an additional threshold t ≥ t. In a broadcast protocol with extended validity, both consistency and validity are achieved when no more than t players are corrupted, and validity is achieved even when up to t players are corrupted. Similarly, we define broadcast with extended consistency. We prove that broadcast with extended validity as well as broadcast with extended consistency is achievable if and only if t + 2t < n (or t = 0). For example, six players can achieve broadcast when at most one player is corrupted (this result was known to be optimal), but they can even achieve consistency (or validity) when two players are corrupted. Furthermore, our protocols achieve detection in case of failure, i.e., if at most t players are corrupted then broadcast is achieved, and if at most t players are corrupted then broadcast is achieved or every player learns that the protocol failed. This protocol can be employed in the precomputation of a secure multi-party computation protocol, resulting in detectable multi-party computation, where up to t corruptions can be tolerated and up to t corruptions can either be tolerated or detected in the precomputation, for any t, t with t + 2t < n.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Byzantine Preferential Voting

In the Byzantine agreement problem, n nodes with possibly different input values aim to reach agreement on a common value in the presence of t < n/3 Byzantine nodes which represent arbitrary failures in the system. This paper introduces a generalization of Byzantine agreement, where the input values of the nodes are preference rankings of three or more candidates. We show that consensus on pref...

متن کامل

Validation study of the extended theory of reasoned action questionnaire for drug abuse prevention in adolescents

The aim of this study was to design and assess the validity and reliability of the theory of reasoned action extended version questionnaire for drug abuse avoidance in Iranian male adolescents. Validity and reliability of a measure consisting of TRA and self efficacy construct for substance abuse avoidance was assessed by scientific methods. Cross-sectional data was collected via self-admini...

متن کامل

Reconnguration and Transient Recovery in State-machine Architectures

We consider an architecture for ultra-dependable operation based on synchronized state machine replication, extended to provide transient recovery and reconnguration in the presence of Byzantine faults. The architecture allows processors suspected of being faulty to be placed on \probation." Processors in this status cannot disrupt other processors, but those that are nonfaulty or recovering fr...

متن کامل

A Unified Fault-Tolerance Protocol

Davies and Wakerly show that Byzantine fault tolerance can be achieved by a cascade of broadcasts and middle value select functions. We present an extension of the Davies and Wakerly protocol, the unified protocol, and its proof of correctness. We prove that it satisfies validity and agreement properties for communication of exact values. We then introduce bounded communication error into the m...

متن کامل

Byzantine Agreement with Median Validity

We introduce a stronger validity property for the byzantine agreement problem with orderable initial values: The median validity property. In particular, the decision value is required to be close to the median of the initial values of the non-byzantine nodes. The proximity to the median scales with the desired level of fault-tolerance: If no fault-tolerance is required, algorithms have to deci...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IACR Cryptology ePrint Archive

دوره 2002  شماره 

صفحات  -

تاریخ انتشار 2002